Almost sure asymptotic optimality for online routing and machine scheduling problems
نویسندگان
چکیده
In this paper we study algorithms for online routing and machine scheduling problems. The problems are “online” because the problem instances are revealed incrementally. We first study algorithms for the online Traveling Repairman Problem (TRP), where a single server is to visit a set of locations in a network with the objective of minimizing the sum of weighted completion times. We then analyze well-known online algorithms for a variety of machine scheduling problems, which are appropriate models for many network optimization problems; in the scheduling notation of Graham et al. [18], we consider 1|rj , pmtn| ∑ j wjCj , 1|rj | ∑ j wjCj , Q|rj , pmtn| ∑ j Cj , P |rj | ∑ j Cj , Q|rj , pmtn| ∑ j wjCj and Q|rj | ∑ j wjCj . We introduce general probabilistic assumptions about the problem data as a tool to study the online algorithms for these online combinatorial problems. The algorithms do not utilize the underlying probabilistic assumptions in any way. We prove that these online algorithms are almost surely asymptotically optimal.
منابع مشابه
Almost Sure Asymptotic Optimality in Online Machine Scheduling
In this paper, we analyze well-known online algorithms for the following problems: 1|rj , pmtn| ∑ j wjCj , 1|rj | ∑ j wjCj , Q|rj , pmtn| ∑ j Cj and P |rj | ∑ j Cj . We consider the Weighted Shortest Processing Requirement (WSPR) heuristic, its non-preemptive version (NWSPR), the Shortest Remaining Processing Requirement on Fastest Machine (SRPR-FM) heuristic, and the Shortest Processing Requir...
متن کاملOnline Optimization in Routing and Scheduling
In this thesis we study online optimization problems in routing and scheduling. An online problem is one where the problem instance is revealed incrementally. Decisions can (and sometimes must) be made before all information is available. We design and analyze (polynomial-time) online algorithms for a variety of problems. We utilize worst-case competitive ratio (and relaxations thereof), asympt...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملStatic Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Online Appendix)
متن کامل
Online Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 55 شماره
صفحات -
تاریخ انتشار 2010